Termination proof of /tmp/tmp7qR4Y-/LengthOfFiniteLists

Termination of the following Term Rewriting System could not be shown:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

The replacement map contains the following entries:

zeros: empty set
cons: {1}
0: empty set
and: {1}
tt: empty set
length: {1}
nil: empty set
s: {1}

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

Context-sensitive rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

The replacement map contains the following entries:

zeros: empty set
cons: {1}
0: empty set
and: {1}
tt: empty set
length: {1}
nil: empty set
s: {1}

The CSR is orthogonal. By [10] we can switch to innermost.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

Context-sensitive rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

The replacement map contains the following entries:

zeros: empty set
cons: {1}
0: empty set
and: {1}
tt: empty set
length: {1}
nil: empty set
s: {1}

Innermost Strategy.

Using Improved CS-DPs we result in the following initial Q-CSDP problem.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

Q-restricted context-sensitive dependency pair problem:
The symbols in {length, s, LENGTH} are replacing on all positions.
For all symbols f in {cons, and, AND} we have µ(f) = {1}.
The symbols in {U} are not replacing on any position.

The ordinary context-sensitive dependency pairs DP_o are:

LENGTH(cons(N, L)) → LENGTH(L)

The collapsing dependency pairs are DP_c:

AND(tt, X) → X
LENGTH(cons(N, L)) → L

The hidden terms of R are:

zeros

Every hiding context is built from:none

Hence, the new unhiding pairs DP_u are :

AND(tt, X) → U(X)
LENGTH(cons(N, L)) → U(L)
U(zeros) → ZEROS

The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
and(tt, x0)
length(nil)
length(cons(x0, x1))

The approximation of the Context-Sensitive Dependency Graph contains 1 SCC with 3 less nodes.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

            ↳ QCSDP

              ↳ ConvertedToQDPProblemProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

Q-restricted context-sensitive dependency pair problem:
The symbols in {length, s, LENGTH} are replacing on all positions.
For all symbols f in {cons, and} we have µ(f) = {1}.

The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
and(tt, x0)
length(nil)
length(cons(x0, x1))

Converted QDP Problem, but could not keep Q or minimality.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

            ↳ QCSDP

              ↳ ConvertedToQDPProblemProof

                ↳ QDP

                  ↳ NonTerminationProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

s = LENGTH(zeros) evaluates to t =LENGTH(zeros)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

LENGTH(zeros) → LENGTH(cons(0, zeros))
with rule zeros → cons(0, zeros) at position [0] and matcher [ ]

LENGTH(cons(0, zeros)) → LENGTH(zeros)
with rule LENGTH(cons(N, L)) → LENGTH(L)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

We applied the Incomplete Giesl Middeldorp transformation [11] to transform the context-sensitive TRS to a usual TRS.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(nil) → nil
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(nil) → 0
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(nil) → nil
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(nil) → 0
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

lengthActive(nil) → 0

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = 2·x₁ + x₂
POL(andActive(x₁, x₂)) = 2·x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(length(x₁)) = 2·x₁
POL(lengthActive(x₁)) = 2·x₁
POL(mark(x₁)) = x₁
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(nil) → nil
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(nil) → nil
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

mark(nil) → nil

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = 2·x₁ + 2·x₂
POL(andActive(x₁, x₂)) = 2·x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(length(x₁)) = 2·x₁
POL(lengthActive(x₁)) = 2·x₁
POL(mark(x₁)) = 2·x₁
POL(nil) = 2
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
andActive(tt, X) → mark(X)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

andActive(tt, X) → mark(X)

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = 2 + 2·x₁ + x₂
POL(andActive(x₁, x₂)) = 2 + 2·x₁ + x₂
POL(cons(x₁, x₂)) = x₁ + 2·x₂
POL(length(x₁)) = 2·x₁
POL(lengthActive(x₁)) = 2·x₁
POL(mark(x₁)) = x₁
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(tt) → tt
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

zerosActive → zeros
mark(and(x1, x2)) → andActive(mark(x1), x2)
mark(tt) → tt

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = 1 + x₁ + 2·x₂
POL(andActive(x₁, x₂)) = 1 + x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(length(x₁)) = x₁
POL(lengthActive(x₁)) = x₁
POL(mark(x₁)) = 2·x₁
POL(s(x₁)) = x₁
POL(tt) = 1
POL(zeros) = 1
POL(zerosActive) = 2

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
andActive(x1, x2) → and(x1, x2)
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

andActive(x1, x2) → and(x1, x2)

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = x₁ + x₂
POL(andActive(x₁, x₂)) = 1 + 2·x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + x₂
POL(length(x₁)) = x₁
POL(lengthActive(x₁)) = x₁
POL(mark(x₁)) = x₁
POL(s(x₁)) = x₁
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(length(x1)) → lengthActive(mark(x1))
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

mark(length(x1)) → lengthActive(mark(x1))

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(length(x₁)) = 1 + 2·x₁
POL(lengthActive(x₁)) = 1 + 2·x₁
POL(mark(x₁)) = 2·x₁
POL(s(x₁)) = x₁
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
lengthActive(x1) → length(x1)
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

lengthActive(x1) → length(x1)

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(cons(x₁, x₂)) = 2·x₁ + x₂
POL(length(x₁)) = x₁
POL(lengthActive(x₁)) = 1 + x₁
POL(mark(x₁)) = x₁
POL(s(x₁)) = x₁
POL(zeros) = 0
POL(zerosActive) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(0) → 0
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

mark(0) → 0

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(cons(x₁, x₂)) = 1 + x₁ + x₂
POL(lengthActive(x₁)) = x₁
POL(mark(x₁)) = 1 + x₁
POL(s(x₁)) = x₁
POL(zeros) = 0
POL(zerosActive) = 1

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(cons(x1, x2)) → cons(mark(x1), x2)
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

mark(cons(x1, x2)) → cons(mark(x1), x2)

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(cons(x₁, x₂)) = 2 + x₁ + 2·x₂
POL(lengthActive(x₁)) = x₁
POL(mark(x₁)) = 2 + 2·x₁
POL(s(x₁)) = x₁
POL(zeros) = 0
POL(zerosActive) = 2

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

Q is empty.

The TRS is overlay and locally confluent. By [19] we can switch to innermost.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

  ↳ Trivial-Transformation

Q restricted rewrite system:
The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(N, L)) → MARK(L)
MARK(zeros) → ZEROSACTIVE
LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L))
MARK(s(x1)) → MARK(x1)

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(N, L)) → MARK(L)
MARK(zeros) → ZEROSACTIVE
LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L))
MARK(s(x1)) → MARK(x1)

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                      ↳ QDP

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

MARK(s(x1)) → MARK(x1)

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                      ↳ QDP

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

MARK(s(x1)) → MARK(x1)

R is empty.
The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ QDPSizeChangeProof

                                                      ↳ QDP

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

MARK(s(x1)) → MARK(x1)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

MARK(s(x1)) → MARK(x1)
The graph contains the following edges 1 > 1

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L))

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)
lengthActive(cons(N, L)) → s(lengthActive(mark(L)))

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L))

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive
lengthActive(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

lengthActive(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L))

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule LENGTHACTIVE(cons(N, L)) → LENGTHACTIVE(mark(L)) at position [0] we obtained the following new rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive)
LENGTHACTIVE(cons(y0, s(x0))) → LENGTHACTIVE(s(mark(x0)))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive)
LENGTHACTIVE(cons(y0, s(x0))) → LENGTHACTIVE(s(mark(x0)))

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive)

The TRS R consists of the following rules:

mark(zeros) → zerosActive
mark(s(x1)) → s(mark(x1))
zerosActive → cons(0, zeros)

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive)

The TRS R consists of the following rules:

zerosActive → cons(0, zeros)

The set Q consists of the following terms:

mark(zeros)
mark(s(x0))
zerosActive

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

mark(zeros)
mark(s(x0))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Narrowing

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive)

The TRS R consists of the following rules:

zerosActive → cons(0, zeros)

The set Q consists of the following terms:

zerosActive

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(zerosActive) at position [0] we obtained the following new rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(cons(0, zeros))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Narrowing

                                                                                  ↳ QDP

                                                                                    ↳ UsableRulesProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(cons(0, zeros))

The TRS R consists of the following rules:

zerosActive → cons(0, zeros)

The set Q consists of the following terms:

zerosActive

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Narrowing

                                                                                  ↳ QDP

                                                                                    ↳ UsableRulesProof

                                                                                      ↳ QDP

                                                                                        ↳ QReductionProof

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(cons(0, zeros))

R is empty.
The set Q consists of the following terms:

zerosActive

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

zerosActive

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ RRRPoloQTRSProof

            ↳ QTRS

              ↳ RRRPoloQTRSProof

                ↳ QTRS

                  ↳ RRRPoloQTRSProof

                    ↳ QTRS

                      ↳ RRRPoloQTRSProof

                        ↳ QTRS

                          ↳ RRRPoloQTRSProof

                            ↳ QTRS

                              ↳ RRRPoloQTRSProof

                                ↳ QTRS

                                  ↳ RRRPoloQTRSProof

                                    ↳ QTRS

                                      ↳ RRRPoloQTRSProof

                                        ↳ QTRS

                                          ↳ Overlay + Local Confluence

                                            ↳ QTRS

                                              ↳ DependencyPairsProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ AND

                                                      ↳ QDP

                                                      ↳ QDP

                                                        ↳ UsableRulesProof

                                                          ↳ QDP

                                                            ↳ QReductionProof

                                                              ↳ QDP

                                                                ↳ Narrowing

                                                                  ↳ QDP

                                                                    ↳ DependencyGraphProof

                                                                      ↳ QDP

                                                                        ↳ UsableRulesProof

                                                                          ↳ QDP

                                                                            ↳ QReductionProof

                                                                              ↳ QDP

                                                                                ↳ Narrowing

                                                                                  ↳ QDP

                                                                                    ↳ UsableRulesProof

                                                                                      ↳ QDP

                                                                                        ↳ QReductionProof

                                                                                          ↳ QDP

  ↳ Trivial-Transformation

Q DP problem:
The TRS P consists of the following rules:

LENGTHACTIVE(cons(y0, zeros)) → LENGTHACTIVE(cons(0, zeros))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We applied the Trivial transformation to transform the context-sensitive TRS to a usual TRS.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
and(tt, X) → X
length(nil) → 0
length(cons(N, L)) → s(length(L))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

and(tt, X) → X
length(nil) → 0

Used ordering:
Polynomial interpretation [25]:

POL(0) = 0
POL(and(x₁, x₂)) = 1 + 2·x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(length(x₁)) = 1 + x₁
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 2
POL(zeros) = 0

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

Q is empty.

The TRS is overlay and locally confluent. By [19] we can switch to innermost.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
length(cons(x0, x1))

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)
ZEROS → ZEROS

The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
length(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)
ZEROS → ZEROS

The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
length(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs.

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                        ↳ UsableRulesProof

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
length(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ QReductionProof

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

R is empty.
The set Q consists of the following terms:

zeros
length(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

zeros
length(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ QReductionProof

                              ↳ QDP

                                ↳ QDPSizeChangeProof

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(cons(N, L)) → LENGTH(L)

From the DPs we obtained the following set of size-change graphs:

LENGTH(cons(N, L)) → LENGTH(L)
The graph contains the following edges 1 > 1

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

ZEROS → ZEROS

The TRS R consists of the following rules:

zeros → cons(0, zeros)
length(cons(N, L)) → s(length(L))

The set Q consists of the following terms:

zeros
length(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

ZEROS → ZEROS

R is empty.
The set Q consists of the following terms:

zeros
length(cons(x0, x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

zeros
length(cons(x0, x1))

↳ CSR

  ↳ CSRInnermostProof

  ↳ Incomplete Giesl Middeldorp-Transformation

  ↳ Trivial-Transformation

    ↳ QTRS

      ↳ RRRPoloQTRSProof

        ↳ QTRS

          ↳ Overlay + Local Confluence

            ↳ QTRS

              ↳ DependencyPairsProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ QReductionProof

                              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ZEROS → ZEROS

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.